Schematisation of Tree Drawings
نویسندگان
چکیده
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the drawing must lie within a given distance r of each original point p ∈ S, and an objective function counting the number of bends must be minimised. We propose five versions of this problem using different objective functions, and algorithms to solve them. This work has potential applications in geographic map schematisation and metro map layout.
منابع مشابه
A Unified View of Tree Automata and Term Schematisations
We propose an extension of tree automata, called N-automata, which captures some of the features of term schematisation languages, for instance the use of counter variables and parameters. We show that the satisfiability problem is decidable for positive, purely existential, membership formulae which permits to include the proposed formalism into most existing symbolic computation procedures (s...
متن کاملIncreasing the readability of graph drawings with centrality-based scaling
A common problem in visualising some networks is the presence of localised high density areas in an otherwise sparse graph. Applying common graph drawing algorithms on such networks can result in drawings that are not highly readable in the dense areas. Additionally, networks whose layouts are defined geographically often have dense areas that are located within small geographical regions relat...
متن کاملA Simple Algorithm for Constructing Perfect Monolinear Sona Tree Drawings, and its Application to Visual Art Education
The traditional sona drawing art of Angola is compared from the structural point of view to similar geometric arts found in other parts of the world. A simple algorithm is proposed for constructing a sub-class of sona drawings, called perfect monolinear sona drawings, on a given set of points in the plane, that exhibit the topological structure of a tree. The application of the tree sona drawin...
متن کاملWell-Nested Drawings as Models of Syntactic Structure
This paper investigates drawings (totally ordered forests) as models of syntactic structure. It offers a new model-based perspective on lexicalised Tree Adjoining Grammar by characterising a class of drawings structurally equivalent to tag derivations. The drawings in this class are distinguished by a restricted form of non-projectivity (gap degree at most one) and the absence of interleaving s...
متن کاملEfficient Spatial Data Structure for Multiversion Management of Engineering Drawings
In the engineering database system, multiple versions of a design including engineering drawings should be managed efficiently. The paper proposes an extended spatial data structure for efficient management of multiversion engineering drawings. The R-tree is adapted as a basic data structure. The efficient mechanism to manage the difference between drawings is introduced to the R-tree to elimin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006